#!/usr/bin/env python
def gen_humble(n):
    primes=[]
    factors = [2, 3, 5, 7]
    res = [1, 2, 3, 4, 5, 6, 7]
    cnt = 7
    num = 8
    while cnt < n:
        is_divided = False       
        is_humble = False
        for prime in primes:
            if num % prime == 0:
                is_divided = True
                break
        else:
            for factor in factors:
                if num % factor == 0:
                    cnt += 1
                    res.append(num)
                    print num
                    is_humble = True
                    break
            if is_humble == False:
                primes.append(num)
        num += 1
    return res
print gen_humble(1000)
                

